Circuit and bond polytopes on series–parallel graphs
نویسندگان
چکیده
منابع مشابه
Circuit and bond polytopes on series-parallel graphs
In this paper, we describe the circuit polytope on series-parallel graphs. We first show the existence of a compact extended formulation. Though not being explicit, its construction process helps us to inductively provide the description in the original space. As a consequence, using the link between bonds and circuits in planar graphs, we also describe the bond polytope on series-parallel graphs.
متن کاملPolytopes, Graphs, and Complexes
During the last few years the theory of convex polytopes has been developing at an ever accelerating pace. As a consequence, many parts of the book "Convex Polytopes" ([CP] =Grünbaum [1967a]), which was essentially completed early in 1966, are by now completely out of date. The same fate befell the surveys by Klee [1966] and Grünbaum [l967b]; even the more recent survey by GrünbaumShephard [196...
متن کاملPolytopes, graphs and fitness landscapes
Darwinian evolution can be illustrated as an uphill walk in a landscape, where the surface consists of genotypes, the height coordinates represent fitness, and each step corresponds to a point mutation. Epistasis, roughly defined as the dependence between the fitness effects of mutations, is a key concept in the theory of adaptation. Important recent approaches depend on graphs and polytopes. F...
متن کاملSemisymmetric graphs from polytopes
Every finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which are edgebut not vertex-transitive). In particular, the Gray graph arises as the medial layer graph of a certain universal locally toroidal regular 4-polytope.
متن کاملGraphs of transportation polytopes
Article history: Received 17 October 2007 Available online 28 April 2009
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2015
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2015.04.001